package code.cando;

/**
 * author : yeswater
 * date : 2023/12/9
 * 
 * 爬楼梯
 */

public class T070 {
    public int climbStairs(int n) {
        int[] dp = new int[n+1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i < n+1; i++) {
            dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[n];
    }
}
